Diversity Analysis of Symbol-by-Symbol Linear Equalizers
نویسندگان
چکیده
منابع مشابه
Diversity Order of Infinite-length Symbol-by-symbol Linear Equalization
The processing complexity of optimal receivers in frequency selective channels grows exponentially with the channel memory length. Linear receivers, alternatively, offer significantly less complexity with the cost of performance degradation. Such degradation can be due to not fully capturing the inherent frequency diversity or degraded coding gain. In this paper we investigate how effectively t...
متن کاملAn optimum symbol-by-symbol decoding rule for linear codes
A decoding rule is presented which minimizes the probability of symbol error over a time-discrete memoryless channel for any linear error-correcting code when the code words are equiprobable. The complexity of this rule varies inversely with code rate, making the technique particularly attractive for high rate codes. Examples are given for both block and convolutional codes.
متن کاملSymbol-by-Symbol MAP Decoding of Variable Length Codes
In this paper we introduce a new approach in the decoding of variable length codes. Based on the tree structure of these codes a trellis representation is derived which allows the application of the BCJR algorithm. This algorithm provides us with the a posteriori probabilities of the transmitted source symbols. Therefore we do not only use soft information from an outer decoding stage but also ...
متن کاملOn the Optimality of Symbol-by-Symbol Communication
When is uncoded transmission optimal? This paper derives easy-to-check necessary and suÆcient conditions that do not require nding the rate-distortion and the capacity-cost functions. We consider the symbol-by-symbol communication of discretetime memoryless sources across discrete-time memoryless channels, using single-letter coding and decoding. This is an optimal communication system if and o...
متن کاملSymbol-by-Symbol MAP Decoding of Nonbinary Codes
Symbol-by-symbol maximum a posteriori (MAP) decoding algorithms for linear nonbinary block and convolutional codes over both extension elds GF(q = p a) and integer rings Z q are presented. Equivalent MAP decoding rules employing the dual code are given which are computationally more eecient for high-rate codes. The suitabil-ity of the proposed algorithms is demonstrated by applying them to a pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2011
ISSN: 0090-6778
DOI: 10.1109/tcomm.2011.062311.100285